Minimal path length of trees with known fringe
نویسندگان
چکیده
منابع مشابه
Minimal Path Length of Trees with Known Fringe
In this paper we continue the study of the path length of trees with known fringe as initiated by 1] and 2]. We compute the path length of the minimal tree with given number of leaves N and fringe for the case N=2. This complements the result of 2] that studied the case N=2. Our methods also yields a linear time algorithm for constructing the minimal tree when N=2.
متن کاملA Note on the Expected Path Length of Trees with Known Fringe
The path length of a tree, that is the sum of the lengths of all root-leaf paths, is an important measure of eeciency of the tree. The fringe of a tree is the diierence between the lengths of the longest path and the shortest path in the tree. The minimal and the maximal path length of trees with N leaves and given fringe have been well studied. In this paper, we initiate the study of the expec...
متن کاملISA[ k ] Trees: a Class of Binary Search Trees with Minimal or Near Minimal Internal Path Length
In recent years several authors have investigated binary search trees with minimal internal path length. In this paper we propose relaxing the requirement of inserting all nodes on one level before going to the next level. This leads to a new class of binary search trees called ISA[k] trees. We investigated the average locate cost per node, average shift cost per node, total insertion cost, and...
متن کاملThe total path length of split trees
We consider the model of random trees introduced by Devroye [SIAM J Comput 28, 409– 432, 1998]. The model encompasses many important randomized algorithms and data structures. The pieces of data (items) are stored in a randomized fashion in the nodes of a tree. The total path length (sum of depths of the items) is a natural measure of the efficiency of the algorithm/data structure. Using renewa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1995
ISSN: 0304-3975
DOI: 10.1016/0304-3975(95)80033-6